Controllable system

Definition

A system is called (completely) controllable if for any initial time t0t_0, any initial state 𝐱(t0)\mathbf{x}(t_0) can be transferred to any final state 𝐱*\mathbf{x}^* (i.e. 𝐱(t)=𝐱*(t)\mathbf{x}(t) = \mathbf{x}^*(t)) using some input 𝐮[t0,t]\underset{\sim}{\mathbf{u}}[t_0, t] over a finite time interval (i.e. tt is finite).

Refinements

Total controllability

If the system is completely controllable over every (or almost every) finite interval.

Strong controllability

If the system is controllable from each input terminal.

Output controllability

If the system output (rather than state) can be set arbitrarily at some finite time tt, by using an appropriate input.

Controllability conditions for analog systems

Consider analog linear system 𝐱̇(t)=A(t)𝐱(t)+B(t)𝐮(t)𝐲(t)=C(t)𝐱(t)+D(t)𝐮(t)\begin{align} \\ \dot{\mathbf{x}}(t) = A(t)\mathbf{x}(t)+B(t)\mathbf{u}(t) \\ \\ \mathbf{y}(t) = C(t)\mathbf{x}(t)+D(t)\mathbf{u}(t) \end{align}

with analog bounded A(t)A(t).

Define P(t0,t)=t0tϕ(t,τ)B(τ)BT(τ)ϕT(t,τ)dτP(t_0,t) = \int_{t_0}^t \phi(t,\tau) B(\tau)B^T(\tau)\phi^T(t,\tau)d\tau where ϕ(t,τ)\phi(t,\tau) denotes a transition matrix from time tt to time τ\tau.

Alternatively using ϕ(t,τ)=ϕ(t,t0)ϕ(t0,τ)\phi(t,\tau) = \phi(t,t_0)\phi(t_0,\tau), P(t0,t)=ϕ(t0,τ)t0tϕ(t0,τ)B(τ)BT(τ)ϕT(t0,τ)dτϕ(t,t0)P(t_0,t) = \phi(t_0,\tau)\int_{t_0}^t \phi(t_0,\tau) B(\tau)B^T(\tau)\phi^T(t_0,\tau)d\tau \phi(t,t_0)

Controllability from origin

The system is controllable if any state can be reached from the origin in finite time.

Condition 1

This system is controllable if and only if given any t0t_0, P(t0,t)P(t_0,t) is nonsingular for some finite t>t0t > t_0.

When A(t)A(t) is bounded for all finite tt, we know that ϕ(t,t0)\phi(t,t_0) is nonsingular for all finite tt, so P(t0,t)P(t_0,t) is nonsingular if and only if the matrix Ŝ(t0,t)t0tϕ(t0,τ)B(τ)BT(τ)ϕT(t0,τ)dτ\hat{S}(t_0,t) \triangleq \int_{t_0}^t \phi(t_0,\tau) B(\tau)B^T(\tau)\phi^T(t_0,\tau)d\tau is nonsingular. Equivalently, if for every constant vector 𝛍𝟎\mathbf{\mu} \neq \mathbf{0}, 𝛍TŜ(t0,t)𝛍=t0t𝛍Tϕ(t0,τ)B(τ)BT(τ)ϕT(t0,τ)𝛍dτ>0\mathbf{\mu}^T \hat{S}(t_0,t)\mathbf{\mu} = \int_{t_0}^t \mathbf{\mu}^T \phi(t_0,\tau) B(\tau)B^T(\tau)\phi^T(t_0,\tau)\mathbf{\mu} d\tau > 0

Condition 2

This continuous-time system is controllable if and only if given any t0t_0, and for every 𝛍𝟎\mathbf{\mu} \neq \mathbf{0}, the vector 𝐳(τ)BT(τ)ϕT(t0,τ)𝛍\mathbf{z}(\tau) \triangleq B^T(\tau) \phi^T(t_0,\tau)\mathbf{\mu} is not identically zero for τt0\tau \geq t_0.

Controllability test for fixed continuous-time system

Controllable if and only if for every 𝛍𝟎\mathbf{\mu} \neq \mathbf{0}, BT(Ak)𝛍𝟎B^T (A^k) \mathbf{\mu} \neq \mathbf{0} for at least one k=0,1,2,...,n1k = 0,1,2,...,n-1.

Controllability test for fixed analog-time system

(In the case of the standard form state equations, this occurs when A,B,C,DA,B,C,D are not dependent upon tt)

When the controllability grammian

Controllability conditions for discrete systems

Consider discrete linear system 𝐱(k+1)=A(k)𝐱(k)+B(k)𝐮(k)𝐲(k)=C(k)𝐱(k)+D(k)𝐮(k)\begin{eqnarray} \mathbf{x}(k+1) = A(k) \mathbf{x}(k) + B(k) \mathbf{u}(k) \\ \mathbf{y}(k) = C(k) \mathbf{x}(k) + D(k) \mathbf{u}(k) \end{eqnarray}

Condition 1'

The system is controllable if and only if given any k0k_0, there exists a finite k>k0k > k_0 such that P(k0,k)i=k0k1ϕ(k,i+1)B(i)BT(i)ϕT(k,i+1)P'(k_0,k) \triangleq \sum_{i=k_0}^{k-1} \phi(k,i+1)B(i)B^T(i)\phi^T(k,i+1) is nonsingular. Note ϕ(k,i+1)\phi(k,i+1) is the transition matrix between kk and i+1i+1.

Condition 2'

The system is controllable if and only if given any k0k_0 there exists a finite k>k0k>k_0 such that for every 𝛌𝟎\mathbf{\lambda} \neq \mathbf{0}, the vector 𝐯(i)=BT(i)ϕT(k,i+1)𝛌\mathbf{v}(i) = B^T(i)\phi^T(k,i+1)\mathbf{\lambda} is nonzero for some value i=k0,...,k1i = k_0,...,k-1, i.e. v0\underset{\sim}v \neq 0 on [k0,k1][k_0,k-1].

Condition 2''

The system is controllable if and only if given any k0k_0 and for every 𝛍𝟎\mathbf{\mu} \neq \mathbf{0}, the vector 𝐳(i)=BT(i)ϕT(k0,i+1)𝛍\mathbf{z}(i) = B^T(i) \phi^T(k_0,i+1)\mathbf{\mu} is nonzero for some value of ik0i \geq k_0.

Here ϕT(k0,i+1)[A(i)A(i1)...A(k0)]1\phi^T(k_0,i+1) \triangleq [A(i) A(i-1)...A(k_0)]^{-1} for ik0i \geq k_0.

Controllability test for fixed discrete-time system

For fixed discrete-time systems, the state equation becomes

For

Γ\Gamma

Condition 3

#incomplete


References

  1. P. E. Sarachik, Principles of Linear Systems, Cambridge Press, 1996, pp. 151-158.